A palimpsest memory based on an incremental Bayesian learning rule
نویسندگان
چکیده
منابع مشابه
A palimpsest memory based on an incremental Bayesian learning rule
Capacity limited memory systems need to gradually forget old information in order to avoid catastrophic forgetting where all stored information is lost. This can be achieved by allowing new information to overwrite old, as in the so-called palimpsest memory. This paper describes a new such learning rule employed in an attractor neural network. The network does not exhibit catastrophic forgettin...
متن کاملProbabilistic Incremental Rule Learning
This paper describes PISCES 1.2E, a system for incremental learning of probabilistic rules. PISCES is efficiently incremental in the sense that both its processing time per instance and its memory usage are independent of the number of training instances. Classification accuracy alone does not provide a sufficient measure of performance for probabilistic classifiers. Additional measures include...
متن کاملIncremental Rule Learning with Partial Instance Memory for Changing Concepts
Learning concepts that change over time is important for a variety of applications in which an intelligent system must acquire and use a behavioral profile. Computer intrusion detection, calendar scheduling, and intelligent user interfaces are three examples. An interesting class of methods for learning such concepts consists of algorithms that maintain a portion of previously encountered examp...
متن کاملIncremental Naïve Bayesian Learning Algorithm based on Classification Contribution Degree
In order to improve the ability of gradual learning on the training set gotten in batches of Naive Bayesian classifier, an incremental Naïve Bayesian learning algorithm is improved with the research on the existing incremental Naïve Bayesian learning algorithms. Aiming at the problems with the existing incremental amending sample selection strategy, the paper introduced the concept of sample Cl...
متن کاملPalimpsest Memories: a New High-capacity Forgetful Learning Rule for Hoppeld Networks
Preprint Abstract Palimpsest or forgetful learning rules for attractor neural networks do not suuer from catastrophic forgetting. Instead they selectively forget older memories in order to store new patterns. Standard palimpsest learning algorithms have a capacity of up to 0:05n, where n is the size of the network. Here a new learning rule is introduced. This rule is local and incremental. It i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2000
ISSN: 0925-2312
DOI: 10.1016/s0925-2312(00)00270-8